Bounded Parikh Automata
نویسندگان
چکیده
منابع مشابه
Bounded Parikh Automata
Motivation. Adding features to finite automata in order to capture situations beyond regularity has been fruitful to many areas of research. Such features include making the state sets infinite, adding power to the logical characterizations, having the automata operate on infinite domains rather than finite alphabets, adding stack-like mechanisms, etc. (See, e.g., [11, 3, 17, 1].) Model checkin...
متن کاملParikh-Equivalent Bounded Underapproximations
Many problems in the verification of concurrent software systems reduce to checking the non-emptiness of the intersection of contextfree languages, an undecidable problem. We propose a decidable underapproximation, and a semi-algorithm based on the under-approximation, for this problem through bounded languages. Bounded languages are context-free subsets of regular languages of the form w∗ 1w ∗...
متن کاملParikh Image of Pushdown Automata
We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with n states and p ≥ 2n + 4 stack symbols that accepts one single long word for which every equivalent contextfree grammar needs Ω(n(p− 2n− 4)) variables. This family shows that the classical algorithm for converting a PDA to an equivalent contextfree...
متن کاملRegular Separability of Parikh Automata
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is ...
متن کاملBounded Arithmetic, Proof Complexity and Two Papers of Parikh
This article surveys R. Parikh’s work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh’s papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.63.13